Model Checking: From BDDs to Interpolation

نویسنده

  • Orna Grumberg
چکیده

In this paper we describe the development of model checking from BDD-based verification, through SAT-based bug finding, to Interpolation-based verification. Model checking is an automatic approach to formally verifying that a given system satisfies a given specification. BDD-based Symbolic Model Checking (SMC) was the first to enable model checking of real-life designs with a few hundreds of state elements. Currently, SAT-based model checking is the most widely used method for verifying industrial designs. This is due to its ability to handle designs with thousands of state elements and more. Its main drawback, however, is its orientation towards ”bug-hunting” rather than full verification. In this paper we present two SAT-based approaches to full verification. The approaches combine BMC with interpolation or interpolationsequence in order to compute an over-approximated set of the system’s reachable states while checking that the specification is not violated. We compare the two methods both algorithmically and experimentally and conclude that they are incomparable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems

ion Refinement with Craig Interpolation and Symbolic Pushdown Systems ? Javier Esparza, Stefan Kiefer, and Stefan Schwoon Institute for Formal Methods in Computer Science, University of Stuttgart {esparza,kiefersn,schwoosn}@informatik.uni-stuttgart.de Abstract. Counterexample-guided abstraction refinement (CEGAR) has proven to be a powerful method for software model-checking. In this paper, we ...

متن کامل

A Survey of Abstract BDDs

We survey and unify recent work about abstraction within BDD packages. Abstract BDDs (aBDDs) are obtained from ordinary BDDs by merging BDD nodes whose abstract values coincide. We discuss four types of abstract BDDs (called S-type, 0-type, 1type and ∨-type aBDDs) which have found applications in many CAD-related areas such as equivalence checking, variable ordering and model checking. Experime...

متن کامل

BDD-Based Software Model Checking with CPAchecker

In symbolic software model checking, most approaches use predicates as symbolic representation of the state space, and SMT solvers for computations on the state space; BDDs are sometimes used as auxiliary data structure. The representation of software state spaces by BDDs was not yet thoroughly investigated, although BDDs are successful in hardware verification. The reason for this is that BDDs...

متن کامل

Symbolic Model Checking without BDDs

Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stålmarck’s Method [16] or the Davis & Putnam Procedure [7], can replace BDDs. This new technique avoids the space blow up of BDDs, generates c...

متن کامل

Verifying Safety Properties of a PowerPC 1 Microprocessor Using Symbolic Model Checking without BDDs

In [2] Bounded Model Checking with the aid of satis ability solving (SAT) was introduced as an alternative to traditional symbolic model checking based on solving xpoint equations with BDDs. In this paper we show how bounded model checking can take advantage of specialized optimizations. We present a bounded version of the cone of in uence reduction that works very well for verifying safety pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012